A certain extremal problem for graphs with $\alpha (G)\leq 2$
نویسندگان
چکیده
منابع مشابه
An Extremal Problem for Complete Bipartite Graphs
Define f(n, k) to be the largest integer q such that for every graph G of order n and size q, G contains every complete bipartite graph K u, ,, with a+h=n-k . We obtain (i) exact values for f(n, 0) and f(n, 1), (ii) upper and lower bounds for f(n, k) when ku2 is fixed and n is large, and (iii) an upper bound for f(n, lenl) .
متن کاملExtremal graphs for the identifying code problem
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from other vertices by the set of vertices in C that are at distance at most 1 from x. The problem of finding an identifying code of minimum possible size turned out to be a challenging problem. It was proved by N. Bertrand, I. Charon, O. Hudry and A. Lobstein that if a graph on n vertices with...
متن کاملAn extremal problem for H-linked graphs
We introduce the notion of H-linked graphs, where H is a fixed multigraph with vertices w1; . . . ;wm. A graph G is H-linked if for every choice of vertices v1; . . . ; vm in G, there exists a subdivision of H in G such that vi is the branch vertex representing wi (for all i). This generalizes the notions of k -linked, k -connected, and k-ordered graphs. Given k and n 5k þ 6, we determine the l...
متن کاملAn Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth
We study the maximal number of edges a C2k-free subgraph of a random graph Gn;p may have, obtaining best possible results for a range of p = p(n). Our estimates strengthen previous bounds of F uredi 12] and Haxell, Kohayakawa, and Luczak 13]. Two main tools are used here: the rst one is an upper bound for the number of graphs with large even-girth, i.e., graphs without short even cycles, with a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1973
ISSN: 0528-2195
DOI: 10.21136/cpm.1973.117809